Compilation of Holding List by Computer

XENO: Computer-Assisted Compilation of Crossword Puzzles

XENO is a suite of programs which assist in the creation of crossword puzzles. It is an extension of a diagram filling program presented earlier. Complete puzzles can be produced under the control of a small number of parameters, clues being selected from an indexed file. It is possible to generate thematic puzzles by including keywords in the input parameters. Use of a tree searching method re...

Design of Thickener by Computer

A mathematical method for calculation of the minimum cross-sectional area of a thickener is presented by obtaining minimum laboratory batch settling test data, a function, which is called settling function, is derived. This function is found to be in the form of a polynomial of third order. The settling function and mass flux relation are used for the design of thickener. The method predict...

Knowledge compilation from DNF to switch-list representations

In this short note we will present a less common way how to represent a Boolean function, namely a representation by switch-list. There are two problems connected to such representation: (1) a knowledge compilation problem, i.e. a problem of transforming a given representation of a Boolean function (e.g. a DNF, CNF, BDD ...) into a switch-listl representation, and (2) a knowledge compression pr...

Reducing Compilation Time by a Compilation Server

In language systems that support separate compilation, we often observe that header files are internalized over and over again when the source files that depend on them are compiled. Making a compiler a long-lived server eliminates such redundant processing of header files, thus reducing the compilation time. The paper first describes compilation servers for C-family languages in general, and t...

List of Contents